POWER: A Domain-Independent Algorithm for Probabilistic, Open-World Entity Resolution Tom Williams and Matthias Scheutz Abstract— The problem of uniquely identifying an entity described in natural language, known as re

Source URL: hrilab.tufts.edu

´ THE CALDERON PROBLEM WITH PARTIAL DATA IN TWO DIMENSIONS OLEG YU. IMANUVILOV, GUNTHER UHLMANN, AND MASAHIRO YAMAMOTO Abstract. We prove for a two dimensional bounded domain that the Cauchy data for the

Source URL: www.math.washington.edu

The Structure of Transdisciplinary Research – Six Case Studies Jochen Jaeger and Martin Scheringer, Akademie für Technikfolgenabschätzung, Industriestr. 5, DStuttgart, and Laboratorium für Technische Chemie,

Source URL: www.env-science.ethz.ch

• Knowledge
• Academia
• Education
• Transdisciplinarity
• Pedagogy
• ETH Domain
• Educational psychology
• Discipline
• Interdisciplinarity
• Branches of science
• ETH Zurich
• Problem solving

DYNAMIC FREQUENCY AND VOLTAGE SCALING FOR A MULTIPLE-CLOCK-DOMAIN MICROPROCESSOR MULTIPLE CLOCK DOMAINS IS ONE SOLUTION TO THE INCREASING PROBLEM OF PROPAGATING THE CLOCK SIGNAL ACROSS INCREASINGLY LARGER AND

Source URL: www.ece.rochester.edu

THE RANDOM ORACLE MODEL: A TWENTY-YEAR RETROSPECTIVE NEAL KOBLITZ AND ALFRED J. MENEZES Abstract. It has been roughly two decades since the random oracle model for reductionist security arguments was introduced and one d

Source URL: cacr.uwaterloo.ca

• Diffie–Hellman problem
• Full Domain Hash
• Rabin signature algorithm
• Oracle machine
• Optimal asymmetric encryption padding
• Digital signature
• Schnorr signature
• Standard model
• RSA
• Cryptography
• Public-key cryptography
• Random oracle

REGULARITY FOR THE FRACTIONAL GELFAND PROBLEM UP TO DIMENSION 7 XAVIER ROS-OTON Abstract. We study the problem (−∆)s u = λeu in a bounded domain Ω ⊂ Rn , where λ is a positive parameter. More precisely, we stud

Source URL: www.ma.utexas.edu

Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc

Source URL: infolab.stanford.edu

• Logic in computer science
• Logic programming
• Automated planning and scheduling
• Formal methods
• Conjunctive normal form
• Situation calculus
• Planning Domain Definition Language
• Algorithm
• Boolean satisfiability problem
• Theoretical computer science
• Mathematics
• Applied mathematics

ESA Patentverwertungsagentur Sachsen-Anhalt GmbH Technology Offer Antibody technology Problem to be solved

Source URL: www.esa-pva.de

• Glycobiology
• Monoclonal antibodies
• Immunology
• Antibodies
• Single-domain antibody
• Immunoglobulin G
• Single-chain variable fragment
• Immunoglobulin heavy chain
• Primary and secondary antibodies
• Biology
• Immune system
• Glycoproteins

Authors’ preprint. The final publication is available at www.springerlink.com. (http://www.springerlink.com/content/w01w784704364806/) P LATAS – Integrating Planning and the Action Language Golog Jens Claßen · Gabr

Source URL: ai.cs.unibas.ch

• Mathematics
• Situation calculus
• Theoretical computer science
• Formal languages
• STRIPS
• Planning Domain Definition Language
• Frame problem
• Combinatory logic
• Action language
• Artificial intelligence
• Automated planning and scheduling
• Logic programming

Problem Decomposition for Reuse Daniel Jackson Michael Jackson School of Computer Science MAJ Consulting Ltd Carnegie Mellon University

Source URL: mcs.open.ac.uk

• Systems science
• Problem frames approach
• Systems analysis
• Software design
• Decomposition
• Routing
• Router
• Frame
• Problem domain
• Systems engineering
• Systems theory
• Software development